A Real-Time Communication Method for Wormhole Switching Networks

نویسندگان

  • Byungjae Kim
  • Jong Kim
  • Sung Je Hong
  • Sunggu Lee
چکیده

In this paper, we propose a real-time communication scheme that can be used in general point-to-point real-time multicomputer systems with wormhole switching. Real-time communication should satisfy the two requirements of predictability and priority handling. Since traditional wormhole switching does not support priority handling, which is essential in real-time computing, flit-level preemption is adopted in our wormhole switching. Also, we develop an algorithm to determine the message transmission delay upper bound to predict worst-case message delay. Simulation results show that the delay upper bounds calculated using the proposed algorithm are very close to actual average message transmission delays for messages with high priorities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real-time wormhole channels

For real-time communication, we must be able to guarantee timely delivery of messages. In recent years, improvements in technology have made possible switch-based local area networks (LANs) and system area networks (SANs) that use wormhole switching, a pipelined switching technique which permits significantly shorter network latencies and higher throughputs than traditional store-and-forward pa...

متن کامل

Path Selection for Real-Time Communication in Wormhole Networks

For real-time communication, we must be able to guarantee timely delivery of messages. In a previous paper, Kim et al. presented a real-time communication method for networks which uses a deterministic wormhole routing algorithm. It would be more desirable to be able to use an adaptive wormhole routing algorithm. However, the use of an adaptive algorithm results in highly unpredictable communic...

متن کامل

Guaranteed Periodic Real-Time Communication over Wormhole Switched Networks

In this paper, we investigate how to e ciently implement TDMA (Time Division Multiple Access) on a wormhole switched network using a pure software solution in the end nodes. Transmission is con ict free on the time-slot level and hence deadlock free. On the subslot level, however, con icts are possible when using early sending, a method we propose in order to reduce latency while still not haza...

متن کامل

Improvement of Schedulability Analysis with a Priority Share Policy in On-Chip Networks

Priority-based wormhole switching with a priority share policy has been proposed as a possible solution for real-time on-chip communication. However, the blocking introduced by priority share complicates the analysis process. In this paper, we propose a new “per-priority” basis analysis scheme which computes the total time window at each priority level instead of each traffic-flow. By checking ...

متن کامل

Schedulability Analysis for Fixed Priority Wormhole Switching in On-Chip Networks

In this paper, we discuss a real-time on-chip communication service with a priority-based wormhole switching policy. A novel off-line schedulability analysis approach and its extension are presented. By evaluating diverse inter-relationships among the traffic-flows, this approach can predict the packet network latency for all practical situations. Due to the inevitable existence of parallel int...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998